Convergent Iterative Constrained Variation Algorithm for Calculation of Electron-Transfer Transition States
نویسندگان
چکیده
We present an efficient mathematical framework to determine the potential-dependent transition states of electron transfer reactions by quantum calculations. This approach makes it more feasible to study heterogeneous electron transfer processes with the theory of local reaction center for electron transfer. It is shown that the new formulation regenerates previously published results obtained by the constrained variation method. Our solution algorithm replaces the constrained optimization problem defined in a multidimensional space by a single equation in terms of only one variable that is solved for in each iteration. This method leads to fast convergence, reliability, and robustness of the located transition states for more complex systems with a larger number of degrees of freedom, especially for smooth energy surfaces. © 2006 The Electrochemical Society. DOI: 10.1149/1.2160449 All rights reserved.
منابع مشابه
Superlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کاملConstrained Nonlinear Optimal Control via a Hybrid BA-SD
The non-convex behavior presented by nonlinear systems limits the application of classical optimization techniques to solve optimal control problems for these kinds of systems. This paper proposes a hybrid algorithm, namely BA-SD, by combining Bee algorithm (BA) with steepest descent (SD) method for numerically solving nonlinear optimal control (NOC) problems. The proposed algorithm includes th...
متن کاملA matrix LSQR algorithm for solving constrained linear operator equations
In this work, an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$ and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$ where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$, $mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$, $ma...
متن کاملFast System Matrix Calculation in CT Iterative Reconstruction
Introduction: Iterative reconstruction techniques provide better image quality and have the potential for reconstructions with lower imaging dose than classical methods in computed tomography (CT). However, the computational speed is major concern for these iterative techniques. The system matrix calculation during the forward- and back projection is one of the most time- cons...
متن کاملQuick iterative scheme for the calculation of transfer matrices : application to MO ( 100 )
The transfer matrix of a solid described by the stacking of principal layers is obtained by an iterative procedure which takes into account 2" layers after n iterations, in contrast to usual schemes where each iteration includes just one more layer. The Green function and density of states at the surface of the corresponding semi-infinite crystal are then given by well known formulae in terms o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006